N-Valid trees in wavelet theory on Vilenkin groups
نویسندگان
چکیده
منابع مشابه
Herz-type Besov Spaces on Locally Compact Vilenkin Groups
Let G be a locally compact Vilenkin group. In this paper the characterizations of the Herz-type Besov space on G are obtained. And some properties of this space are discussed.
متن کاملLimit groups and groups acting freely on R n-trees.
We give a simple proof of the finite presentation of Sela's limit groups by using free actions on R n-trees. We first prove that Sela's limit groups do have a free action on an R n-tree. We then prove that a finitely generated group having a free action on an R n-tree can be obtained from free abelian groups and surface groups by a finite sequence of free products and amalgamations over cyclic ...
متن کاملLimit groups and groups acting freely on $\bbR^n$-trees
We give a simple proof of the finite presentation of Sela's limit groups by using free actions on R n-trees. We first prove that Sela's limit groups do have a free action on an R n-tree. We then prove that a finitely generated group having a free action on an R n-tree can be obtained from free abelian groups and surface groups by a finite sequence of free products and amalgamations over cyclic ...
متن کاملTranslation Invariant Operators on Hardy Spaces over Vilenkin Groups
We show that a number of well known multiplier theorems for Hardy spaces over Vilenkin groups follow immediately from a general condition on the kernel of the multiplier operator. In the compact case, this result shows that the multiplier theorems of Kitada [6], Tateoka [13], Daly-Phillips [2], and Simon [11] are best viewed as providing conditions on the partial sums of the Fourier-Vilenkin se...
متن کاملWavelet Trees Meet Suffix Trees
We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n over an alphabet of size σ ≤ n, our method builds the wavelet tree in O(n log σ/ √ logn) time, improving upon the state-of-the-art algorithm by a factor of √ log n. As a consequence, given an array of n integers we c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Wavelets, Multiresolution and Information Processing
سال: 2015
ISSN: 0219-6913,1793-690X
DOI: 10.1142/s021969131550037x